The logic of categorematic and syncategorematic infinity
نویسنده
چکیده
منابع مشابه
Medieval Theories of Quantification
Medieval authors approached the semantic phenomenon now known as quantification essentially by means of the concept of supposition, more specifically with the different modes of personal supposition. The modes of personal supposition were meant to codify the quantificational behavior of what we now refer to as quantifier expressions, and what the medievals referred to as syncategorematic terms....
متن کاملINCLUSION RELATIONS CONCERNING WEAKLY ALMOST PERIODIC FUNCTIONS AND FUNCTIONS VANISHING AT INFINITY
We consider the space of weakly almost periodic functions on a transformation semigroup (S, X , ?) and show that if X is a locally compact noncompact uniform space, and ? is a separately continuous, separately proper, and equicontinuous action of S on X, then every continuous function on X, vanishing at infinity is weakly almost periodic. We also use a number of diverse examples to show ...
متن کاملAn approach to rank efficient DMUs in DEA based on combining Manhattan and infinity norms
In many applications, discrimination among decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA). The DEA models unable to discriminate between extremely efficient DMUs. Hence, there is a growing interest in improving discrimination power in DEA yet. The aim of this paper is ranking extreme efficient DMUs in DEA based on exp...
متن کاملCategorematic unreducible polyadic quantifiers in Lexical Resource Semantics
Early work on quantification in natural languages showed that sentences like Every ape picked different berries, on the reading that the sets of berries picked by any two apes are not the same, can be logically represented with a single polyadic quantifier for the two nominal phrases. However, since that quantifier cannot be decomposed into two quantifiers for the two nominal phrases, a composi...
متن کاملRanking efficient DMUs using the infinity norm and virtual inefficient DMU in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The purpose of this paper is ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Synthese
دوره 192 شماره
صفحات -
تاریخ انتشار 2015